Numerical Determination of the Optimal Bedding Plane
نویسندگان
چکیده
منابع مشابه
determination of maximal singularity free zones in the workspace of parallel manipulator
due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...
15 صفحه اولthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولNumerical Study of Interaction of Two Plane Parallel Jets
In the present work, a numerical simulation of two parallel turbulent jets was performed. The simulations were carried out by using the standard, the standard and the RSM models. A parametric study was also presented to determine the effect of the nozzles spacing and velocity ratio on the axial and transverse positions of the merge and combined points. Correlations between the various paramet...
متن کاملNumerical Simulation of Free Surface in the Case of Plane Turbulent Wall Jets in Shallow Tailwater
Wall-jet flow is an important flow field in hydraulic engineering, and its applications include flow from the bottom outlet of dams and sluice gates. In this paper, the plane turbulent wall jet in shallow tailwater is simulated by solving the Reynolds Averaged Navier-Stokes equations using the standard turbulence closure model. This study aims to explore the ability of a time splitting method ...
متن کاملOptimal Backlog in the Plane
Version • n cups – not on a graph nor in the plane • Timesteps – adversary pours total 1 of water – player empties any cup • Deamortization [Dietz,Sleator’87] – Empty-the-fullest: Hn An Extension: (τ,k)-game • n cups – not on a graph nor in the plane • Timesteps – adversary pours total τ of water – player empties k fullest cups • After r steps – backlog in any cup is ≤ Hr • τ / k • independent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geological data processing
سال: 1987
ISSN: 0388-502X,1347-541X
DOI: 10.6010/geoinformatics1975.1987.12_299